- joint asymptotic efficiency
- Контроль качества: совместная асимптотическая эффективность (оценки)
Универсальный англо-русский словарь. Академик.ру. 2011.
joint asymptotic efficiency
Смотреть что такое "joint asymptotic efficiency" в других словарях:
Linear regression — Example of simple linear regression, which has one independent variable In statistics, linear regression is an approach to modeling the relationship between a scalar variable y and one or more explanatory variables denoted X. The case of one… … Wikipedia
Bayes estimator — In decision theory and estimation theory, a Bayes estimator is an estimator or decision rule that maximizes the posterior expected value of a utility function or minimizes the posterior expected value of a loss function (also called posterior… … Wikipedia
Cauchy distribution — Not to be confused with Lorenz curve. Cauchy–Lorentz Probability density function The purple curve is the standard Cauchy distribution Cumulative distribution function … Wikipedia
Maximum likelihood — In statistics, maximum likelihood estimation (MLE) is a method of estimating the parameters of a statistical model. When applied to a data set and given a statistical model, maximum likelihood estimation provides estimates for the model s… … Wikipedia
Nobel Prizes — ▪ 2009 Introduction Prize for Peace The 2008 Nobel Prize for Peace was awarded to Martti Ahtisaari, former president (1994–2000) of Finland, for his work over more than 30 years in settling international disputes, many involving ethnic,… … Universalium
reptile — reptilelike, adj. reptiloid /rep tl oyd /, adj. /rep til, tuyl/, n. 1. any cold blooded vertebrate of the class Reptilia, comprising the turtles, snakes, lizards, crocodilians, amphisbaenians, tuatara, and various extinct members including the… … Universalium
List of statistics topics — Please add any Wikipedia articles related to statistics that are not already on this list.The Related changes link in the margin of this page (below search) leads to a list of the most recent changes to the articles listed below. To see the most… … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
Noisy-channel coding theorem — In information theory, the noisy channel coding theorem (sometimes Shannon s theorem), establishes that for any given degree of noise contamination of a communication channel, it is possible to communicate discrete data (digital information)… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Confidence distribution — This article is about the confidence distribution. For Confidence interval, see Confidence interval. In statistics, the concept of a confidence distribution (CD) has often been loosely referred to as a distribution function on the parameter space … Wikipedia
